COMPLETE TREE MENSURATION

Indexed Tree Matching with Complete

This paper picks up the Tree Matching approach to integrate the paradigm of structured documents into the eld of Information Retrieval. The concept of Tree Matching is extended by the notion of complete answer representations (CARs), which makes it possible to avoid the combinatorial explosion in the number of solutions (and thus complexity). An algorithm is presented that combines a class of T...

Video Mensuration Using a Stationary Camera

A complete fuzzy decision tree technique

In this paper, a new method of fuzzy decision trees called soft decision trees (SDT) is presented. This method combines tree growing and pruning, to determine the structure of the soft decision tree, with re4tting and back4tting, to improve its generalization capabilities. The method is explained and motivated and its behavior is 4rst analyzed empirically on 3 large databases in terms of classi...

Call Tree Reversal is NP-Complete

The data-flow of a numerical program is reversed in its adjoint. We discuss the combinatorial optimization problem that aims to find optimal checkpointing schemes at the level of call trees. For a given amount of persistent memory the objective is to store selected arguments and/or results of subroutine calls such that the overall computational effort (the total number of floating-point operati...

Monochromatic Tree Partition for Complete Multipartite Graphs

An r-edge-coloring of a graph G is a surjective assignment of r colors to the edges of G. The monochromatic tree partition number of an redge-colored graph G is defined to be the minimum positive integer k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. In this paper, we give a direct proof for the m...